Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
461	Policy Sciences), © Elsevier Scientific Publishing Company, Amsterdam--Printed in Scotland Dilemmas in a General Theory of Planning* H O R S T W. J. R I T T E L Add to Reading List Source URL: jonathanstray.com Language: English - Date: 2012-03-19 14:37:31 Cognition Policy Problem solving Wicked problem Neuropsychological assessment Structural complexity theory Computational complexity theory Reduction Design Theoretical computer science Applied mathematics Mathematics
462	Cognitive Science–33 Copyright ! 2010 Cognitive Science Society, Inc. All rights reserved. ISSN: printonline DOI: j01142.x The AHA! Experience: Creativity Thr Add to Reading List Source URL: cogsci.uwaterloo.ca Language: English - Date: 2011-02-24 11:34:33 Cognition Computational neuroscience Mental processes Educational psychology Problem solving Creativity Paul Thagard Neural network Consciousness Mind Cognitive science Science
463	Connectionism: Representation PHIL/PSYCH 256 INTRODUCTION TO COGNITIVE SCIENCE Add to Reading List Source URL: cogsci.uwaterloo.ca Language: English - Date: 2010-10-25 15:41:37 Cybernetics Neuroscience Learning Cognitive science Connectionism Philosophy of artificial intelligence Artificial neural network Backpropagation Constraint satisfaction problem Computational neuroscience Neural networks Science
464	Fixed-parameter tractability of the Maximum Agreement Supertree problem Sylvain Guillemot, Vincent Berry ´ Equipe M´ Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-09-04 17:36:16 Phylogenetics Computational complexity theory Parameterized complexity Supertree
465	1. Statement of the big problem: Is there a clear statement of the big question? Is it a good big question? Identify the reasons why there is (or isn’t) confidence that the big question is tractable. You should think h Add to Reading List Source URL: earthweb.ess.washington.edu Language: English - Date: 2006-05-07 15:12:56 Knowledge Science studies Problem statement Falsifiability Scientific method Dynamic programming Computational complexity theory Science Problem solving Philosophy of science
466	How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡ Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 1998-12-21 18:16:27 Complexity classes Mathematical optimization NP-complete problems Combinatorial optimization Approximation algorithm NP-complete Hardness of approximation Optimization problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
467	A Computational Field Framework for Collaborative Task Execution in Volunteer Clouds Stefano Sebastio Michele Amoretti Add to Reading List Source URL: dl.dropboxusercontent.com Language: English Ant colony optimization algorithms Stochastic optimization Distributed data storage Travelling salesman problem Ant Distributed computing Computer cluster Distributed hash table Grid computing Computing Concurrent computing Theoretical computer science
468	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 4 25 March 1999 ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 1999-04-30 15:06:50 Complexity classes NP P versus NP problem Randomized algorithm PP Random self-reducibility RP P Normal distribution Theoretical computer science Computational complexity theory Applied mathematics
469	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2000-02-20 22:53:43 NP-complete problems Conjunctive normal form Combinatorics Boolean satisfiability problem String Permutation PP 2-satisfiability MAX-3SAT Theoretical computer science Mathematics Computational complexity theory
470	Part A Simulation and Statistical Programming HT 2015 Problem Sheet 3 due Week 7 Tuesday 10am 1. (a) Give a Metropolis-Hastings algorithm to sample according to the Gamma probability density function, p(x) ∝ xα−1 ex Add to Reading List Source URL: www.stats.ox.ac.uk Language: English - Date: 2015-02-23 13:52:48 Computational statistics Probability and statistics Markov models Markov processes Metropolis–Hastings algorithm Markov chain Gibbs sampling Itō diffusion Bayesian inference in phylogeny Statistics Monte Carlo methods Markov chain Monte Carlo

UPDATE